Synchronous Structured String-Tree Correspondence (S-SSTC)

نویسنده

  • MOSLEH H. AL-ADHAILEH
چکیده

In this paper, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is introduced. We propose a variant of SSTC called synchronous SSTC. Synchronous SSTC can be used to describe the correspondence between different languages. We will also describe how synchronous SSTC provides the flexibility to treat some of the non-standard cases, which are problematic to other synchronous formalisms. The proposed synchronous SSTC schema well suited to describe the correspondence between different languages, in particular, relating a language with its translation in another language (i.e. in Machine Translation). Synchronous SSTC can be used as annotation for translation systems that automatically extract transfer mappings (rules or examples) from bilingual corpora. The synchronous SSTC also can be used to construct a Bilingual Knowledge Bank (BKB), where the examples are kept in form of synchronous SSTCs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Converting a Bilingual Dictionary into a Bilingual Knowledge Bank based on the Synchronous SSTC

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from an English Malay bilingual dictionary based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the...

متن کامل

The Construction of Bilingual Knowledge Bank based on the Synchronous SSTC Annotation Schema

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from a given bilingual corpus based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the string, and ...

متن کامل

Representation trees and string-tree correspondences

The correspondence between a string of a language and its abstract representation, usually a (decorated) tree, is not straightforward. However, it is desirable to maintain it, for example to build structured editors for texts written in natural language. As such correspondences must be compositional, we call them "Structured String-Tree Correspondences" (SSTC). We argue that a SSTC is in fact c...

متن کامل

Example-Based Machine Translation Based on the Synchronous SSTC Annotation Schema

In this paper, we describe an Example-Based Machine Translation (EBMT) system for EnglishMalay translation. Our approach is an examplebased approach which relies sorely on example translations kept in a Bilingual Knowledge Bank (BKB). In our approach, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is used to annotate both the source and target sentences of a tr...

متن کامل

A Flexible Example-based Parser Based on the Sstc"

In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their representation structure, and on the knowledge that we can get from these examples the required information to parse a new input s e n t e n c e . In our approach, examples are annotated with the Structured String Tree Correspo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001